f(a, a) → f(a, b)
f(a, b) → f(s(a), c)
f(s(X), c) → f(X, c)
f(c, c) → f(a, a)
↳ QTRS
↳ DependencyPairsProof
f(a, a) → f(a, b)
f(a, b) → f(s(a), c)
f(s(X), c) → f(X, c)
f(c, c) → f(a, a)
F(s(X), c) → F(X, c)
F(a, a) → F(a, b)
F(c, c) → F(a, a)
F(a, b) → F(s(a), c)
f(a, a) → f(a, b)
f(a, b) → f(s(a), c)
f(s(X), c) → f(X, c)
f(c, c) → f(a, a)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
F(s(X), c) → F(X, c)
F(a, a) → F(a, b)
F(c, c) → F(a, a)
F(a, b) → F(s(a), c)
f(a, a) → f(a, b)
f(a, b) → f(s(a), c)
f(s(X), c) → f(X, c)
f(c, c) → f(a, a)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(c, c) → F(a, a)
Used ordering: Polynomial interpretation [25,35]:
F(s(X), c) → F(X, c)
F(a, a) → F(a, b)
F(a, b) → F(s(a), c)
The value of delta used in the strict ordering is 1/2.
POL(c) = 1
POL(a) = 0
POL(s(x1)) = x_1
POL(b) = 0
POL(F(x1, x2)) = (1/2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
F(s(X), c) → F(X, c)
F(a, a) → F(a, b)
F(a, b) → F(s(a), c)
f(a, a) → f(a, b)
f(a, b) → f(s(a), c)
f(s(X), c) → f(X, c)
f(c, c) → f(a, a)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
F(s(X), c) → F(X, c)
f(a, a) → f(a, b)
f(a, b) → f(s(a), c)
f(s(X), c) → f(X, c)
f(c, c) → f(a, a)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(s(X), c) → F(X, c)
The value of delta used in the strict ordering is 1/2.
POL(c) = 0
POL(s(x1)) = 1/4 + (7/2)x_1
POL(F(x1, x2)) = (2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(a, a) → f(a, b)
f(a, b) → f(s(a), c)
f(s(X), c) → f(X, c)
f(c, c) → f(a, a)